KARAKTERISASI MODUL CYCLICALLY PURE (CP)-INJEKTIF

Simplified Sele for Protection Modul

This paper presents a modif Selective Fault Tolerance method, substantial area reduction over the stat technique is proved to achieve substant and better reliability results when appl with the so-called SAM method for relia The simulation results show that improvement of up to over 20% in terms overhead, compared with the state of the to a classic TMR we obtain improveme with a mean improvement...

Comparing ASP, CP, ILP on Haplotype Inference by Pure Parsimony

We study three declarative programming paradigms, Answer Set Programming (ASP), Constraint Programming (CP), and Integer Linear Programming (ILP), on a challenging application: Haplotype Inference by Pure Parsimony (HIPP). We represent HIPP in each formalism in a systematic way, compare the formulations both from the point of view of knowledge representation (e.g., how easy it is to represent s...

Spatial Covert At tention: Perceptual Modul ation

Cyclically Orientable Graphs

Barot, Geiss and Zelevinsky define a notion of a “cyclically orientable graph” and use it to devise a test for whether a cluster algebra is of finite type. Barot, Geiss and Zelivinsky’s work leaves open the question of giving an efficient characterization of cyclically orientable graphs. In this paper, we give a simple recursive description of cyclically orientable graphs, and use this to give ...

On cyclically embeddable graphs

An embedding of a simple graph G into its complement G is a permutation σ on V (G) such that if an edge xy belongs to E(G), then σ(x)σ(y) does not belong to E(G). In this note we consider some families of embeddable graphs such that the corresponding permutation is cyclic.